Minimum k Arborescences with Bandwidth Constraints 1
نویسندگان
چکیده
Let G = (V, A) be a digraph with source r . A weight function w and bandwidth constraint function b (positive integer) on A are given. We present algorithms for finding k r -arborescences in G with minimum total weight and with bandwidth constraints.
منابع مشابه
Matroid-Based Packing of Arborescences
We provide the directed counterpart of a slight extension of Katoh and Tanigawa’s result [8] on rooted-tree decompositions with matroid constraints. Our result characterizes digraphs having a packing of arborescences with matroid constraints. It is a proper extension of Edmonds’ result [1] on packing of spanning arborescences and implies – using a general orientation result of Frank [4] – the a...
متن کاملBlocking Optimal k-Arborescences
Given a digraph D = (V,A) and a positive integer k, an arc set F ⊆ A is called a karborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from ...
متن کاملA Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc disjoint paths between any pair of vertices. We give a simple (1 + 1/k)-approximation to the unweighted variant of the problem, where all arcs ofG have the same cost. This improves on the 1+2/k approximation of Gabow et ...
متن کاملBlocking unions of arborescences
Given a digraphD = (V,A) and a positive integer k, a subset B ⊆ A is called a k-unionarborescence, if it is the disjoint union of k spanning arborescences. When also arc-costs c : A → R are given, minimizing the cost of a k-union-arborescence is well-known to be tractable. In this paper we take on the following problem: what is the minimum cardinality of a set of arcs the removal of which destr...
متن کاملCovering Intersecting Bi-set Families under Matroid Constraints
Edmonds’ fundamental theorem on arborescences [4] characterizes the existence of k pairwise edge-disjoint arborescences with the same root in a directed graph. In [9], Lovász gave an elegant alternative proof which became the base of many extensions of Edmonds’ result. In this paper, we use a modification of Lovász’ method to prove a theorem on covering intersecting bi-set families under matroi...
متن کامل